Address Sequences and Backgrounds with Different Hamming Distances for Multiple Run March Tests

نویسنده

  • Svetlana V. Yarmolik
چکیده

It is widely known that pattern sensitive faults are the most difficult faults to detect during the RAM testing process. One of the techniques which can be used for effective detection of this kind of faults is the multi-background test technique. According to this technique, multiple-run memory test execution is done. In this case, to achieve a high fault coverage, the structure of the consecutive memory backgrounds and the address sequence are very important. This paper defines requirements which have to be taken into account in the background and address sequence selection process. A set of backgrounds which satisfied those requirements guarantee us to achieve a very high fault coverage for multi-background memory testing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances

Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...

متن کامل

طراحی و پیاده‌سازی سامانۀ بی‌درنگ آشکارسازی و شناسایی پلاک خودرو در تصاویر ویدئویی

An automatic Number Plate Recognition (ANPR) is a popular topic in the field of image processing and is considered from different aspects, since early 90s. There are many challenges in this field, including; fast moving vehicles, different viewing angles and different distances from camera, complex and unpredictable backgrounds, poor quality images, existence of multiple plates in the scene, va...

متن کامل

The Normalized Distance Preserving Binary Codes and Distance Table

In the Euclidean space, the approximate nearest neighbors (ANN) search measures the similarity degree through computing the Euclidean distances, which owns high time complexity and large memory overhead. To address these problems, this paper maps the data from the Euclidean space into the Hamming space, and the normalized distance similarity restriction and the quantization error are required t...

متن کامل

Errors induced during PCR amplification

The Polymerase Chain Reaction (PCR) is one of the most widely used techniques in modern molecular biology to amplify a single or few copies of a piece of DNA sequences. The PCR products are used as inputs of many other applications such as diagnosis of diseases. Therefore the accuracy of the further analysis depends on the quality of the PCR outputs. In order to study the amplification process ...

متن کامل

Address and Data Scrambling: Causes and Impact on Memory Tests

The way address sequences and data patterns appear on the outside of a memory may differ from their internal appearance; this effect is referred to as scrambling, which has a large impact on the effectiveness of the used tests. This paper presents an analysis of address and data scrambling for memory chips, at the layout and at the electrical level. A method is presented to determine the data b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computer Science

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2008